Simulating Turing Machines through Extended Mh Systems
نویسنده
چکیده
In this article we describe a method of translation from a deterministic Turing machine to an extended mH splicing system. The accuracy of this translation is proved by a theorem which shows that the only string present in single copy is a coding of a connguration of the simulated Turing machine. A simpler translation from a universal Turing machine with three tapes to an extended mH system is given too.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملA boundary between universality and non-universality in spiking neural P systems
In this work we offer a significant improvement on the previous smallest spiking neural P systems and solve the problem of finding the smallest possible extended spiking neural P system. P˘ aun and P˘ aun [15] gave a universal spiking neural P system with 84 neurons and another that has extended rules with 49 neurons. Subsequently, Zhang et al. [18] reduced the number of neurons used to give un...
متن کاملDNA Computing Based on Splicing: Universality Results.dvi
The paper extends some of the most recently obtained results on the computational universality of extended H systems (with regular sets of rules respectively with finite sets of rules used with simple additional mechanisms) and shows the possibility to obtain universal systems based on these extended H systems, i. e. the theoretical possibility to design programmable universal DNA computers bas...
متن کاملThe Computational Power of Exponential-Space P Systems with Active Membranes
We show that exponential-space P systems with active membranes characterize the complexity class EXPSPACE. This result is proved by simulating Turing machines working in exponential space via uniform families of P systems with restricted elementary active membranes; the simulation is efficient, in the sense that the time and space required are at most polynomial with respect to the resources em...
متن کاملSimulating Turing machines on Maurer machines
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to simulate Turing machines on a Maurer machine which, dissenting from the classical theory of computabi...
متن کامل